Summarization of Association Rules in Multi-tier Granule Mining
نویسندگان
چکیده
It is a big challenge to find useful associations in databases for user specific needs. The essential issue is how to provide efficient methods for describing meaningful associations and pruning false discoveries or meaningless ones. One major obstacle is the overwhelmingly large volume of discovered patterns. This paper discusses an alternative approach called multi-tier granule mining to improve frequent association mining. Rather than using patterns, it uses granules to represent knowledge implicitly contained in databases. It also uses multi-tier structures and association mappings to represent association rules in terms of granules. Consequently, association rules can be quickly accessed and meaningless association rules can be justified according to the association mappings. Moreover, the proposed structure is also an precise compression of patterns which can restore the original supports. The experimental results shows that the proposed approach is promising.
منابع مشابه
Granule mining oriented data warehousing model for representations of multidimensional association rules
To promise the quality of multidimensional association mining in real applications is a challenging research issue. The challenging issue is how to represent multidimensional association rules efficiently because of the complicated correlation between attributes. Multi-tier granule mining is one initiative in solving this challenge. This paper presents a granule mining oriented data warehousing...
متن کاملData Warehousing for Association Mining
IntroductIon With the phenomenal growth of electronic data and information, there are many demands for developments of efficient and effective systems (tools) to address the issue of performing data mining tasks on data warehouses or multidimensional databases. Association rules describe associations between itemsets (i.e., sets of data items) (or granules). Association mining (or called associ...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملKeyphrase Extraction and Grouping Based on Association Rules
Keyphrases are important in capturing the content of a document and thus useful for many natural language processing tasks such as Information Retrieval, Document Classification, and Text Summarization. Keyphrase extraction aims to identify multi-word sequences from a collection of documents that more or less correspond to keyphrases. In this paper, we propose a new method for keyphrase extract...
متن کاملDocument Clustering and Summarization Based on Association Rule Mining for Dynamic Environment
Document Summarization is a technique, which reduces the size of the documents and gives the outline and crisp information about the given group of documents. This paper introduces a new update summarization algorithm incorporating association rule mining and correlated concept based hierarchical clustering for dynamic environment. In this algorithm, the associated concepts are extracted using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Intelligent Informatics Bulletin
دوره 13 شماره
صفحات -
تاریخ انتشار 2012